Graph coloring

Results: 948



#Item
111Finding Approximate and Constrained Motifs in Graphs ? Riccardo Dondi1 , Guillaume Fertin2 , and St´ephane Vialette3 1  Dipartimento di Scienze dei Linguaggi, della Comunicazione e degli Studi Culturali

Finding Approximate and Constrained Motifs in Graphs ? Riccardo Dondi1 , Guillaume Fertin2 , and St´ephane Vialette3 1 Dipartimento di Scienze dei Linguaggi, della Comunicazione e degli Studi Culturali

Add to Reading List

Source URL: pagesperso.lina.univ-nantes.fr

Language: English - Date: 2013-01-07 10:28:15
112Algebraic Methods in the Congested Clique∗ † Keren Censor-Hillel Technion

Algebraic Methods in the Congested Clique∗ † Keren Censor-Hillel Technion

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2015-05-29 10:12:11
113Asychronous distributed graph coloring Keith Briggs & James Evans  http://keithbriggs.info Mobility Research, BT Innovate & Design Department of Mathematics, University of York

Asychronous distributed graph coloring Keith Briggs & James Evans http://keithbriggs.info Mobility Research, BT Innovate & Design Department of Mathematics, University of York

Add to Reading List

Source URL: keithbriggs.info

Language: English - Date: 2010-08-13 12:16:52
114Marcin Jakub Kaminski ´ Université Libre de Bruxelles Département d’Informatique Bvd. du Triomphe, CPBruxelles

Marcin Jakub Kaminski ´ Université Libre de Bruxelles Département d’Informatique Bvd. du Triomphe, CPBruxelles

Add to Reading List

Source URL: rutcor.rutgers.edu

Language: English - Date: 2012-06-08 03:17:45
115Brief Announcement: Efficient Graph Algorithms without Synchronization Johannes Schneider Roger Wattenhofer

Brief Announcement: Efficient Graph Algorithms without Synchronization Johannes Schneider Roger Wattenhofer

Add to Reading List

Source URL: disco.ethz.ch

Language: English - Date: 2014-09-26 08:36:28
116Sudoku Squares and Chromatic Polynomials Agnes M. Herzberg and M. Ram Murty T

Sudoku Squares and Chromatic Polynomials Agnes M. Herzberg and M. Ram Murty T

Add to Reading List

Source URL: www.mast.queensu.ca

Language: English - Date: 2007-07-03 14:08:13
117Diameter of random spanning trees in a given graph Fan Chung ∗

Diameter of random spanning trees in a given graph Fan Chung ∗

Add to Reading List

Source URL: web.cs.du.edu

Language: English - Date: 2010-11-16 10:22:29
118SIAM J. DISCRETE MATH. Vol. 25, No. 4, pp. 1746–1753 c 2011 Society for Industrial and Applied Mathematics 

SIAM J. DISCRETE MATH. Vol. 25, No. 4, pp. 1746–1753 c 2011 Society for Industrial and Applied Mathematics 

Add to Reading List

Source URL: orion.math.iastate.edu

Language: English - Date: 2014-08-22 14:45:12
119Journal of Complex Networks, 177–186 doi:comnet/cnv020 Advance Access publication on 21 July 2015 Network installation under convex costs Alexander Gutfraind†

Journal of Complex Networks, 177–186 doi:comnet/cnv020 Advance Access publication on 21 July 2015 Network installation under convex costs Alexander Gutfraind†

Add to Reading List

Source URL: www.levreyzin.com

Language: English - Date: 2016-07-01 10:19:11
120Symposium on Theoretical Aspects of Computer ScienceNancy, France), ppwww.stacs-conf.org arXiv:1001.3251v2 [cs.CC] 3 FebTHE RECOGNITION OF TOLERANCE

Symposium on Theoretical Aspects of Computer ScienceNancy, France), ppwww.stacs-conf.org arXiv:1001.3251v2 [cs.CC] 3 FebTHE RECOGNITION OF TOLERANCE

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2010-02-04 12:27:34